Greedy Algorithms for Target Coverage Problem in Wireless Sensor Networks

Wireless Sensor Networks have seen tremendous advancement in design and applications in the recent years.Wireless Sensor Networks (WSNs) involve deployment of huge number of wireless sensor nodes essentially for monitoring a certain area and collecting data. These collected data are then sent to the base station which acts like a control room and there further processing is done as per requirements.The rapid advancement of digital electronics and wireless communications has resulted in more rapid development of WSN technology. This rapid growth has resulted in focus being given into solving the challenges that this field has to face. One such challenge is to maximise the network lifetime of the network while the target nodes remain monitored constantly. This problem of maximizing the network lifetime while satisfying the coverage and also energy constraints(sensors are equipped with battery as the only power source and hence the energy constraint) is known as the Target Coverage Problem in Wireless Sensor Networks. In this paper a simulation of an existing technique is simulated.Then a modified version of the algorithm is simulated which is found to give better performance over the existing one